an effective ant colony algorithm for the traveling salesman problem
Authors
abstract
the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is presented which possesses a new strategy to update the increased pheromone, a candidate list and a mutation operation to solve the tsp. in addition, some local search algorithms are utilized as an effective criterion and only a global updating is used in order to increase pheromone on the edges of the best route. the proposed metaheuristic algorithm is tested on the well-known tsp instances involving 14 benchmark problems from 48 to 200 nodes. the computational results show that our algorithm is better than other meta-heuristic algorithms in terms of solution quality. furthermore, the gap of the proposed algorithm stays on average almost 1% of the execution time and also the most best known solutions of the benchmark problems are found.
similar resources
An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
full textThe Accumulated Experience Ant Colony for the Traveling Salesman Problem
Ant colony optimization techniques are usually guided by pheromone and heuristic cost information when choosing the next element to add to a solution. However, while an individual element may be attractive, usually its long term consequences are neither known nor considered. For instance, a short link in a traveling salesman problem may be incorporated into an ant’s solution, yet, as a conseque...
full textParallel Ant Colony Optimization for the Traveling Salesman Problem
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions found in that time; (ii) given a fixed solution quality, the aim is to reduce the time needed to find a solution not worse than that quality. In this article, we study the impact of communication when we parallelize a ...
full textAn Approach for Solving Traveling Salesman Problem
In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...
full textAnt Colony Component-based System for Traveling Salesman Problem
A component-based approach to model Ant Colony System (ACS) for the Traveling Salesman Problem (TSP) is shown in this paper. The used components to solve the TSP with ACS technique and the collaboration rules between components are also described. The internal reasoning about the ant colony component-based system for the TSP gives a better perception of solving this problem using ant-based tech...
full textMy Resources
Save resource for easier access later
Journal title:
journal of advances in computer researchجلد ۷، شماره ۳، صفحات ۷۷-۹۱
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023